Critical points via monodromy and local methods
نویسندگان
چکیده
منابع مشابه
Monodromy problem for the degenerate critical points
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...
متن کاملMonodromy and Stability for Nilpotent Critical Points
We give a new and short proof of the characterization of monodromic nilpotent critical points.We also calculate the first generalized Lyapunov constants in order to solve the stability problem. We apply the results to several families of planar systems obtaining necessary and sufficient conditions for having a center. Our method also allows us to generate limit cycles from the origin.
متن کاملmonodromy problem for the degenerate critical points
for the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. when the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. in this paper we will consider the polynomial planar vector fields ...
متن کاملRandom Matrix Pencils, Branching Points, and Monodromy
We define complex projective n-space CP as C \ {0} under the equivalence relation (z0 : z1 : ... : zn) ∼ (cz0 : cz1 : ... : czn) where c ∈ C\{0}. A complex projective curve is then the set of points (a0 : a1 : ... : an) ∈ CP such that p(a0, a1, ..., an) = 0 for a fixed complex homogeneous polynomial p(z0, z1, ..., zn). Such a curve is a 2-dimensional, real, orientable Riemannian manifold, or Ri...
متن کاملComputing monodromy via continuation methods on random Riemann surfaces
We consider a Riemann surface X defined by a polynomial f(x, y) of degree d, whose coefficients are chosen randomly. Hence, we can suppose that X is smooth, that the discriminant δ(x) of f has d(d− 1) simple roots, ∆, and that δ(0) 6= 0 i.e. the corresponding fiber has d distinct points {y1, . . . , yd}. When we lift a loop 0 ∈ γ ⊂ C−∆ by a continuation method, we get d paths in X connecting {y...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2017
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2016.07.019